A domain theory for statistical probabilistic programming
نویسندگان
چکیده
منابع مشابه
Statistical Inference for Probabilistic Constraint Logic Programming
Most approaches to probabilistic logic programming deal with deduction systems and xpoint semantics for programming systems with user-speci ed weights attached to the formulae of the language, i.e, the aim is to connect logical inference and probabilistic inference. However, such a user-speci c determination of weights is not reusable and often complex. In various applications, automatic method...
متن کاملA Statistical-Probabilistic Pattern for Determination of Tunnel Advance Step by Quantitative Risk Analysis
One of the main challenges faced in design and construction phases of tunneling projects is the determination of maximum allowable advance step to maximize excavation rate and reduce project delivery time. Considering the complexity of determining this factor and unexpected risks associated with inappropriate determination of that, it is necessary to employ a method which is capable of accounti...
متن کاملCantor meets Scott: Domain-Theoretic Foundations for Probabilistic Network Programming
ProbNetKAT is a probabilistic extension of NetKAT with a denotational semantics based on Markov kernels. The language is expressive enough to generate continuous distributions, which raises the question of how to effectively compute in the language. This paper gives an alternative characterization of ProbNetKAT’s semantics using domain theory, which provides the foundations needed to build a pr...
متن کاملProbabilistic Inductive Logic Programming - Theory and Applications
Introducing a new hobby for other people may inspire them to join with you. Reading, as one of mutual hobby, is considered as the very easy hobby to do. But, many people are not interested in this hobby. Why? Boring is the reason of why. However, this feel actually can deal with the book and time of you reading. Yeah, one that we will refer to break the boredom in reading is choosing probabilis...
متن کاملTwo Probabilistic Powerdomains in Topological Domain Theory
We present two probabilistic powerdomain constructions in topological domain theory. The first is given by a free ”convex space” construction, fitting into the theory of modelling computational effects via free algebras for equational theories, as proposed by Plotkin and Power. The second is given by an observationally induced approach, following Schröder and Simpson. We show the two constructi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the ACM on Programming Languages
سال: 2019
ISSN: 2475-1421
DOI: 10.1145/3290349